class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        while (left < right) {
            int middle = left + (right - left) / 2;
            if (nums[middle] >= target)  right = middle;
            else left = middle + 1;
        }
        if (nums[right] < target)    right = right + 1;
        return right;
    }
};